An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Authors

  • Amin Rezaeipanah Department of Computer, Faculty of Computer, University of Rahjuyan Danesh Borazjan, Bushehr, Iran
  • Mahdi Hajiani Technical and Vocational University, College of Bushehr, Bushehr, Iran
Abstract:

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical concepts in the field of investigation and many attempts have been made by researchers in this area. Due to the importance of transportation issues in the real world and the status of these issues in the types of existing systems. In this paper, we investigate the Vehicle Routing Problem with Time Window (VRPTW) and provide a solution for it. The problem of routing vehicles with a time window is an extension of the problem of routing vehicles with limited capacity (CVRP) in which servicing must be done in a specific time window. The purpose of this problem is to optimize the route for each vehicle so as to minimize the total cost of the route and the number of vehicles used, and ultimately maximize customer satisfaction. In the paper, a hybrid method based on cuckoo search and greedy algorithm is proposed to solve the problem of VRPTW. For the cost function, different criteria have been used that are within the framework of the VRPTW problem within hard and soft constraints. In order to evaluate the proposed method, the dataset is used in different sizes. The proposed method is significantly higher compared to similar methods.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

full text

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a neighborhood solution, we must compute an optimal time schedule of each route. We show that this subproblem can be efficiently solved by dynamic pr...

full text

A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

full text

Cuckoo Search Algorithm for Capacitated Vehicle Routing Problem

The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...

full text

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2

pages  189- 208

publication date 2019-05-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023